Appendix 4.6.b Efficient Computation of Minimum Variance Wavefront Reconstructors Using Sparse Matrix Techniques
نویسنده
چکیده
منابع مشابه
Efficient computation of minimum-variance wave-front reconstructors with sparse matrix techniques.
The complexity of computing conventional matrix multiply wave-front reconstructors scales as O(n3) for most adaptive optical (AO) systems, where n is the number of deformable mirror (DM) actuators. This is impractical for proposed systems with extremely large n. It is known that sparse matrix methods improve this scaling for least-squares reconstructors, but sparse techniques are not immediatel...
متن کاملAppendix 4.6.c a Multigrid Preconditioned Conjugate Gradient Method for Large Scale Wavefront Construction
We introduce a multigrid preconditioned conjugate gradient (MGCG) iterative scheme for computing open loop wavefront reconstructors in the adaptive optics (AO) system of large telescopes. We present numerical simulations which indicate that our MGCG method has a rapid convergence rate for a wide range of sub-aperture gradient measurement signal-to-noise ratios. The cost per iteration is order N...
متن کاملA Computationally EÆcient Wavefront Reconstructor for Simulations of Multi-Conjugate Adaptive Optics on Giant Telescopes
Multi-conjugate adaptive optical (MCAO) systems with from 10 to 10 degrees of freedom have been proposed for future giant telescopes. Using standard matrix methods to compute, optimize, and implement wavefront reconstruction algorithms for these systems is impractical, since the number of calculations required to compute (apply) the reconstruction matrix scales as the cube (square) of the numbe...
متن کاملLayer-Oriented Multigrid Wavefront Reconstruction Algorithms for Multi-Conjugate Adaptive Optics
Multi-conjugate adaptive optics (MCAO) systems with 10 − 10 degrees of freedom have been proposed for future giant telescopes. Using standard matrix methods to compute, optimize, and implement wavefront control algorithms for these systems is impractical, since the number of calculations required to compute (apply) the reconstruction matrix scales with the cube (square) of the number of AO degr...
متن کاملWeb-Site-Based Partitioning Techniques for Efficient Parallelization of the PageRank Computation
The efficiency of the PageRank computation is important since the constantly evolving nature of the Web requires this computation to be repeated many times. PageRank computation includes repeated iterative sparse matrix-vector multiplications. Due to the enourmous size of the Web matrix to be multiplied, PageRank computations are usually carried out on parallel systems. Graph and hypergraph par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002